Geometry of the Welch Bounds
نویسندگان
چکیده
A geometric perspective is used to derive the entire family of Welch bounds. This perspective unifies a number of observations that have been made regarding tightness of the bounds and their connections to symmetric k-tensors, tight frames, homogeneous polynomials, and tdesigns. Index Terms – Frames, Grammian, Homogeneous polynomials, Symmetric tensors, t-designs, Welch bounds
منابع مشابه
Comparing the Bidirectional Baum-Welch Algorithm and the Baum-Welch Algorithm on Regular Lattice
A profile hidden Markov model (PHMM) is widely used in assigning protein sequences to protein families. In this model, the hidden states only depend on the previous hidden state and observations are independent given hidden states. In other words, in the PHMM, only the information of the left side of a hidden state is considered. However, it makes sense that considering the information of the b...
متن کاملMeeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets
The Welch lower bound on the total-squared-correlation (TSC) of binary signature sets is loose for binary signature sets whose length L is not a multiple of 4. Recently Karystinos and Pados developed new bounds that are better than the Welch bound in those cases, and showed how to achieve the bounds with modiied Hadamard matrices except in a couple of cases. In this paper, we study the open cases.
متن کاملGeneralized Baum-Welch and Viterbi Algorithms Based on the Direct Dependency among Observations
The parameters of a Hidden Markov Model (HMM) are transition and emission probabilities‎. ‎Both can be estimated using the Baum-Welch algorithm‎. ‎The process of discovering the sequence of hidden states‎, ‎given the sequence of observations‎, ‎is performed by the Viterbi algorithm‎. ‎In both Baum-Welch and Viterbi algorithms‎, ‎it is assumed that...
متن کاملThe Welch-Lynch Clock Synchronization Algorithm
This note describes the Welch-Lynch fault-tolerant algorithm for clock synchronization. The original proof given by Welch and Lynch shows that the clocks of non-faulty nodes are maintained in approximate agreement. The worst-case skew is bounded by a constant which depends on network and algorithm parameters. We give a simpli ed proof of correctness and obtain tight synchronization bounds.
متن کاملBounds on the Length for the Least-Recently-Visited Token Circulation Algorithm
In this paper, the bounds on round length for the Least-Recently-Visited token circulation algorithm (LRV) in static network are given. We also show that there exist graphs that have executions of LRV with exponential round length.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0909.0206 شماره
صفحات -
تاریخ انتشار 2009